Planar projections of graphs
نویسندگان
چکیده
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, which the edges drawn on projections onto axis-parallel planes. show that Kn has ⌈n/2+2⌉ dimensions Km,n ⌈min(m,n)+1⌉ dimensions. In 3 we there exist graphs with 6n−15 can be projected two orthogonal planes, this is best possible. Finally, obtain bounds terms of geometric thickness caterpillar arboricity, connections unleveled planar graphs. Using such bound, every maximum degree 5 plane-projectable
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملgroup magicness of certain planar graphs
let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the s...
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملRandom planar graphs and the number of planar graphs
We survey recent progress on the enumeration of labelled planar graph and on the distribution of several parameters in random planar graphs. The main goal is to show how to use generating functions to obtain asymptotic estimates and limit probability laws. The emphasis is on presenting the main ideas while keeping technical details to a minimum.
متن کاملCommuting projections on graphs
Motivated by the increasing importance of large-‐scale networks typically modeled by graphs we study properties associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators. The goal is to construct a coarse version of the mixed form for the graph Laplacian operator with the purpose to construct a multilevel hierar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.08.015